منابع مشابه
Geometric Approaches for Top-k Queries
Top-k processing is a well-studied problem with numerous applications that is becoming increasingly relevant with the growing availability of recommendation systems and decision making software. The objective of this tutorial is twofold. First, we will delve into the geometric aspects of top-k processing. Second, we will cover complementary features to top-k queries, with strong practical relev...
متن کاملEvaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the “top k” tuples that best match the given attribute values. In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that traditiona...
متن کاملSelective-NRA Algorithms for Top-k Queries
Efficient processing of top-k queries has become a classical research area recently since it has lots of application fields. Fagin et al. proposed the “middleware cost” for a top-k query algorithm. In some databases there is no way to perform a random access, Fagin et al. proposed NRA (No Random Access) algorithm for this case. In this paper, we provided some key observations of NRA. Based on t...
متن کاملDynamic Top-$k$ Dominating Queries
Let S be a dataset of n 2-dimensional points. The top-k dominating query aims to report the k points that dominate the most points in S . A point p dominates a point q iff all coordinates of p are smaller than or equal to those of q and at least one of them is strictly smaller. The top-k dominating query combines the dominance concept of maxima queries with the ranking function of top-k queries...
متن کاملProcessing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-bound techniques to avoid computing scores of all candidates in identifying the top-k answers. To be able to apply such techniques, it is critical to efficiently compute (lower and upper) bounds and expected scores of cand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2017
ISSN: 2150-8097
DOI: 10.14778/3137765.3137826